Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
نویسندگان
چکیده
منابع مشابه
Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions
We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular we prove that if A is the largest subset of diameter r of n points in the Euclidean space, then for every ǫ > 0 there exists a polynomial time algorithm that outputs a set B of size at least |A| and of diameter at most r( √ 2 + ǫ). On the hardness side r...
متن کاملBin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the following packing problem: Given a collection of d-dimensional rectangles of specified sizes, pack them into the minimum number of unit cubes. We show that unlike the one-dimensional case, the two-dimensional packing problem cannot have an asymptotic polynomial time approximation scheme (APTAS), unless P = NP . On the positive side, we give an APTAS for the special case of packing ...
متن کاملApproximation and Inapproximability Results on Balanced Connected Partitions of Graphs
Let G = (V, E) be a connected graph with a weight function w : V → Z+ and let q ≥ 2 be a positive integer. For X ⊆ V , let w(X) denote the sum of the weights of the vertices in X . We consider the following problem on G: find a q-partition P = (V1, V2, . . . , Vq) of V such that G[Vi] is connected (1 ≤ i ≤ q) and P maximizes min{w(Vi) : 1 ≤ i ≤ q}. This problem is called Max Balanced Connected ...
متن کاملMAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
In an alternative approach to “characterizing” the graph class of visibility graphs of simple polygons, we study the problem of finding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that n...
متن کاملHard graphs for the maximum clique problem
The maximum clique problem is one of the NP-complete problems. There are graphs for which a reduction technique exists that transforms the problem for these graphs into one for graphs with specific properties in polynomial time. The resulting graphs do not grow exponentially in order and number. Graphs that allow such a reduction technique are called soft. Hard graphs are those graphs for which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2008
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.08.005